0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.12 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM 0.12/0.33 % Computer : n002.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1920 0.12/0.33 % WCLimit : 240 0.12/0.33 % DateTime : Wed Jul 30 02:17:49 EDT 2025 0.12/0.33 % CPUTime : 0.20/0.47 Running higher-order theorem proving 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.xJzqMwHL0Z/E---3.1_315.p 0.20/0.49 # Version: 3.0.0-ho 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA. 0.20/0.49 # Scheduled 5 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.49 # Starting sh2lt with 960s (4) cores 0.20/0.49 # Starting new_ho_10_unif with 240s (1) cores 0.20/0.49 # Starting full_lambda_6 with 240s (1) cores 0.20/0.49 # Starting post_as_ho1 with 240s (1) cores 0.20/0.49 # Starting ehoh_best3_rw with 240s (1) cores 0.20/0.49 # new_ho_10_unif with pid 408 completed with status 0 0.20/0.49 # Result found by new_ho_10_unif 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA. 0.20/0.49 # Scheduled 5 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.49 # Starting sh2lt with 960s (4) cores 0.20/0.49 # Starting new_ho_10_unif with 240s (1) cores 0.20/0.49 # No SInE strategy applied 0.20/0.49 # Search class: HHUNF-FFSF11-SHHFFMBN 0.20/0.49 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.49 # Starting new_ho_10 with 108s (1) cores 0.20/0.49 # new_ho_10 with pid 417 completed with status 0 0.20/0.49 # Result found by new_ho_10 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA. 0.20/0.49 # Scheduled 5 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.49 # Starting sh2lt with 960s (4) cores 0.20/0.49 # Starting new_ho_10_unif with 240s (1) cores 0.20/0.49 # No SInE strategy applied 0.20/0.49 # Search class: HHUNF-FFSF11-SHHFFMBN 0.20/0.49 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.49 # Starting new_ho_10 with 108s (1) cores 0.20/0.49 # Preprocessing time : 0.001 s 0.20/0.49 # Presaturation interreduction done 0.20/0.49 0.20/0.49 # Proof found! 0.20/0.49 # SZS status Theorem 0.20/0.49 # SZS output start CNFRefutation 0.20/0.49 thf(decl_sort1, type, a: $tType). 0.20/0.49 thf(decl_23, type, esk1_1: ((a > $o) > a > $o) > (a > $o) > a). 0.20/0.49 thf(decl_24, type, epred1_0: (a > $o) > $o). 0.20/0.49 thf(decl_25, type, esk2_1: (a > $o) > a). 0.20/0.49 thf(decl_26, type, epred2_1: ((a > $o) > a) > a > $o). 0.20/0.49 thf(cTHM533, conjecture, (![X1:(a > $o) > $o]:((![X2:a > $o]:((?[X3:a]:((X2 @ X3))<=(X1 @ X2)))=>?[X4:(a > $o) > a]:(![X2:a > $o]:(((X1 @ X2)=>(X2 @ (X4 @ X2)))))))<=![X5:(a > $o) > a > $o]:(?[X6:(a > $o) > a]:(![X7:a > $o]:(((X5 @ X7 @ (X6 @ X7))<=?[X8:a]:((X5 @ X7 @ X8))))))), file('/export/starexec/sandbox/tmp/tmp.xJzqMwHL0Z/E---3.1_315.p', cTHM533)). 0.20/0.49 thf(c_0_1, negated_conjecture, ~((![X5:(a > $o) > a > $o]:(?[X6:(a > $o) > a]:(![X7:a > $o]:((?[X8:a]:((X5 @ X7 @ X8))=>(X5 @ X7 @ (X6 @ X7))))))=>![X1:(a > $o) > $o]:((![X2:a > $o]:(((X1 @ X2)=>?[X3:a]:((X2 @ X3))))=>?[X4:(a > $o) > a]:(![X2:a > $o]:(((X1 @ X2)=>(X2 @ (X4 @ X2))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM533])])). 0.20/0.49 thf(c_0_2, negated_conjecture, ![X18:(a > $o) > a > $o, X20:a > $o, X21:a, X23:a > $o, X25:(a > $o) > a]:(((~(X18 @ X20 @ X21)|(X18 @ X20 @ (esk1_1 @ X18 @ X20)))&((~(epred1_0 @ X23)|(X23 @ (esk2_1 @ X23)))&((epred1_0 @ (epred2_1 @ X25))&~(epred2_1 @ X25 @ (X25 @ (epred2_1 @ X25))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 0.20/0.49 thf(c_0_3, negated_conjecture, ![X4:(a > $o) > a]:(~((epred2_1 @ X4 @ (X4 @ (epred2_1 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.49 thf(c_0_4, negated_conjecture, ![X2:a > $o]:(((X2 @ (esk2_1 @ X2))|~((epred1_0 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.49 thf(c_0_5, negated_conjecture, ![X4:(a > $o) > a]:((epred1_0 @ (epred2_1 @ X4))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.49 thf(c_0_6, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3, c_0_4]), c_0_5])]), ['proof']). 0.20/0.49 # SZS output end CNFRefutation 0.20/0.49 # Parsed axioms : 2 0.20/0.49 # Removed by relevancy pruning/SinE : 0 0.20/0.49 # Initial clauses : 5 0.20/0.49 # Removed in clause preprocessing : 1 0.20/0.49 # Initial clauses in saturation : 4 0.20/0.49 # Processed clauses : 7 0.20/0.49 # ...of these trivial : 0 0.20/0.49 # ...subsumed : 0 0.20/0.49 # ...remaining for further processing : 7 0.20/0.49 # Other redundant clauses eliminated : 0 0.20/0.49 # Clauses deleted for lack of memory : 0 0.20/0.49 # Backward-subsumed : 0 0.20/0.49 # Backward-rewritten : 0 0.20/0.49 # Generated clauses : 1 0.20/0.49 # ...of the previous two non-redundant : 0 0.20/0.49 # ...aggressively subsumed : 0 0.20/0.49 # Contextual simplify-reflections : 0 0.20/0.49 # Paramodulations : 1 0.20/0.49 # Factorizations : 0 0.20/0.49 # NegExts : 0 0.20/0.49 # Equation resolutions : 0 0.20/0.49 # Disequality decompositions : 0 0.20/0.49 # Total rewrite steps : 1 0.20/0.49 # ...of those cached : 0 0.20/0.49 # Propositional unsat checks : 0 0.20/0.49 # Propositional check models : 0 0.20/0.49 # Propositional check unsatisfiable : 0 0.20/0.49 # Propositional clauses : 0 0.20/0.49 # Propositional clauses after purity: 0 0.20/0.49 # Propositional unsat core size : 0 0.20/0.49 # Propositional preprocessing time : 0.000 0.20/0.49 # Propositional encoding time : 0.000 0.20/0.49 # Propositional solver time : 0.000 0.20/0.49 # Success case prop preproc time : 0.000 0.20/0.49 # Success case prop encoding time : 0.000 0.20/0.49 # Success case prop solver time : 0.000 0.20/0.49 # Current number of processed clauses : 3 0.20/0.49 # Positive orientable unit clauses : 1 0.20/0.49 # Positive unorientable unit clauses: 0 0.20/0.49 # Negative unit clauses : 1 0.20/0.49 # Non-unit-clauses : 1 0.20/0.49 # Current number of unprocessed clauses: 1 0.20/0.49 # ...number of literals in the above : 2 0.20/0.49 # Current number of archived formulas : 0 0.20/0.49 # Current number of archived clauses : 4 0.20/0.49 # Clause-clause subsumption calls (NU) : 0 0.20/0.49 # Rec. Clause-clause subsumption calls : 0 0.20/0.49 # Non-unit clause-clause subsumptions : 0 0.20/0.49 # Unit Clause-clause subsumption calls : 0 0.20/0.49 # Rewrite failures with RHS unbound : 0 0.20/0.49 # BW rewrite match attempts : 0 0.20/0.49 # BW rewrite match successes : 0 0.20/0.49 # Condensation attempts : 7 0.20/0.49 # Condensation successes : 0 0.20/0.49 # Termbank termtop insertions : 499 0.20/0.49 # Search garbage collected termcells : 197 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.003 s 0.20/0.49 # System time : 0.002 s 0.20/0.49 # Total time : 0.005 s 0.20/0.49 # Maximum resident set size: 1716 pages 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.003 s 0.20/0.49 # System time : 0.006 s 0.20/0.49 # Total time : 0.008 s 0.20/0.49 # Maximum resident set size: 1736 pages 0.20/0.49 % E exiting 0.20/0.49 % E exiting 0.20/0.50 EOF